The Complexity of Minimum Convex Coloring
نویسندگان
چکیده
A coloring of the vertices of a graph is called convex if each subgraph induced by all vertices of the same color is connected. We consider three variants of recoloring a colored graph with minimal cost such that the resulting coloring is convex. Two variants of the problem are shown to be NP-hard on trees even if in the initial coloring each color is used to color only a bounded number of vertices. For graphs of bounded treewidth, we present a polynomial-time (2+ )-approximation algorithm for these two variants and a polynomial-time algorithm for the third variant. Our results also show that, unless NP ⊆ DTIME(n log ), there is no polynomial-time approximation algorithm with a ratio of size (1 − o(1)) ln ln n for the following problem: Given pairs of vertices in an undirected graph of bounded treewidth, determine the minimal possible number l for which all except l pairs can be connected by disjoint paths.
منابع مشابه
Efficient Approximation of Convex Recolorings
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if it can be completed to a convex (total) coloring. Convex coloring of trees arise in areas such as phylogenetics, linguistics, etc. eg, a perfect phylogenetic tree is one in which the states of each character induce a ...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملConvex Recolorings of Strings and Trees
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if it can be completed to a convex (total) coloring. Convex coloring of trees arises in areas such as phylogenetics, linguistics, etc. eg, a perfect phylogenetic tree is one in which the states of each character induce a...
متن کاملConvex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if it can be completed to a convex (total) coloring. Convex colorings of trees arise in areas such as phylogenetics, linguistics, etc., e.g., a perfect phylogenetic tree is one in which the states of each character induc...
متن کاملApplying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity
In the past 30 years, results regarding special classes of integer linear (and, more generally, convex) programs flourished. Applications in the field of parameterized complexity were called for and the call has been answered, demonstrating the importance of connecting the two fields. The classical result due to Lenstra states that solving Integer Linear Programming in fixed dimension is polyno...
متن کامل